Sur la conjecture π(x+y)≤π(x)+π(y)

Sur un Cas Particulier de la Conjecture de Cerny

Let A be a finite automaton. We are concerned with the minimal length of the words that send all states on a unique state (synchronizing words). J. Černý has conjectured that, if there exists a synchronizing word in A, then there exists such a word with length 6 (n − 1) where n is the number of states of A. As a generalization, we conjecture that, if there exists a word of rank 6 k in A, there ...

Sur la morphologie et la transmission d'Eperythrozoon coccoîdes

Sur la fréquence de la leptospirose en Iran

Etude sur la digestion pancratique de la caseine pour la production de la toxine tetanique

Sur la frequence de leptospirose en Iran